Preserving Liveness with Rule - Based Refinement of Place / Transition Systems

نویسندگان

  • M. Urbášek
  • J. Padberg
چکیده

The focus of this paper is to endow step-wise modification of nets with refinement that preserves liveness. Modification of nets uses rules that allow substituting subnets of the left hand side by subnets of the right hand side of the rule. Such rules are then restricted so that the liveness is preserved. Rule-based modification is expressed in terms of spans of morphisms and two pushout constructions, thus being in line with the so-called double pushout approach to graph transformations. We then extend the span of morphisms with collapsing morphisms from the right-hand side to the left-hand side of the rule. As these morphisms respect live-ness the extended rules preserve liveness from left to right. Under adequate matches of the rule to a net the corresponding transformation preserves liveness as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Petri Net Transformations

Modelling the adaption of a system to a changing environment gets more and more important. Application areas cover e.g. computer supported cooperative work, multi agent systems, dynamic process mining or mobile networks. One approach to combine formal modelling of dynamic systems and controlled model adaption are Petri net transformations. The main idea behind net transformation is the stepwise...

متن کامل

The Coarsest Precongruences Respecting Safety and Liveness Properties

This paper characterises the coarsest refinement preorders on labelled transition systems that are precongruences for renaming and partially synchronous interleaving operators, and respect all safety, liveness, and conditional liveness properties, respectively.

متن کامل

A Process-Algebraic Semantics for Generalised Nonblocking

Generalised nonblocking is a weak liveness property to express the ability of a system to terminate under given preconditions. This paper studies the notions of equivalence and refinement that preserve generalised nonblocking and proposes a semantic model that characterises generalised nonblocking equivalence. The model can be constructed from the transition structure of an automaton, and has a...

متن کامل

Abstraction Refinement for Termination

ion Refinement for Termination⋆ Byron Cook, Andreas Podelski, and Andrey Rybalchenko 1 Microsoft Research, Cambridge 2 Max-Planck-Institut für Informatik, Saarbrücken Abstract. Abstraction can often lead to spurious counterexamples. Counterexample-guided abstraction refinement is a method of strengthening abstractions based on the analysis of these spurious counterexamples. For invariance prope...

متن کامل

Refactoring, Refinement, and Reasoning - A Logical Characterization for Hybrid Systems

Refactoring of code is a common device in software engineering. As cyber-physical systems (CPS) become ever more complex, similar engineering practices become more common in CPS development. Proper safe developments of CPS designs are accompanied by a proof of correctness. Since the inherent complexities of CPS practically mandate iterative development, frequent changes of models are standard p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002